A fast algorithm for computing distance spectrum of convolutional codes

A fast algorithm for computing distance spectrum of convolutional codes

Computing the distance spectrum of space-time trellis codes

| Space-time trellis code designs mainly focus on maximizing the diversity and coding gains. However, the performance of a space-time code (frame or bit error) is also a function of its \distance spectrum". In this work, expurgated union bounds for frame and bit error probability using the distance spectrum are derived. An eecient distance spectrum computation method which uses a reduced error ...

Distance bounds for convolutional codes and some optimal codes

After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used for deriving a lower bound for the field size of an MDS convolutional code and examples are presented showing that, in most cases, the lower bound is tight. ...

A distance spectrum interpretation of turbo codes

The performance of Turbo codes is addressed by examining the code’s distance spectrum. The ‘error floor’ that occurs at moderate signal-to-noise ratios is shown to be a consequence of the relatively low free distance of the code. It is also shown that the ‘error floor’ can be lowered by increasing the size of the interleaver without changing the free distance of the code. Alternatively, the fre...

An Algebraic Decoding Algorithm for Convolutional Codes

The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...